Several Problems for Predicate Decompositions
نویسندگان
چکیده
In (1a) the patient the pie is realized as an object and in (1b) it is realized as an oblique marked by the preposition at. There is a semantic effect associated with this alternation: when the pie is a direct object it is known to have necessarily been affected in some way, but when it is an oblique it may or may not have been affected, depending on the context (i.e. it is underspecified for affectedness). We point out three general properties of such alternations, which a theory of argument realization should ideally capture. These are given in (2)–(4).
منابع مشابه
Orthogonal Matrix Decompositions in Systemsand
In this paper we present several types of orthogonal matrix decompositions used in systems and control. We focus on those related to eigenvalue and singular value problems and include generalizations to several matrices.
متن کاملPractical Algorithms for Linear Boolean-width
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the generated decompositions. We also evaluated dynamic programming algorithms on linear boolean deco...
متن کاملhtd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond
Decompositions of graphs play a central role in the field of parameterized complexity and are the basis for many fixed-parameter tractable algorithms for problems that are NP-hard in general. Tree decompositions are the most prominent concept in this context and several tools for computing tree decompositions recently competed in the 1st Parameterized Algorithms and Computational Experiments Ch...
متن کاملCut and Count and Representative Sets on Branch Decompositions
Recently, new techniques have been introduced to speed up dynamic programming algorithms on tree decompositions for connectivity problems: the ‘Cut and Count’ method and a method called the rank-based approach, based on representative sets and Gaussian elimination. These methods respectively give randomised and deterministic algorithms that are single exponential in the treewidth, and polynomia...
متن کاملCMPT880 08-1 Tree/Branch Decompositions
The notions of tree decompositions and branch decompositions have received much attention in discrete optimizations. These notions were originally introduced by Robertson and Seymour [15, 16] in the proof of the Graph Minors Theorem, known as Wagner’s conjecture. It is known that practical problems in several research areas, like VLSI design, Cholesky factorization, evolution theory, control fl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007